Optimization Techniques in University Timetabling Problem: Constraints, Methodologies, Benchmarks, and Open Issues

University timetabling problems are a yearly challenging task and faced repeatedly each semester. The considered non-polynomial time (NP) combinatorial optimization (COP), which means that they can be solved through algorithms to produce the aspired optimal timetable. Several techniques have been used solve university problems, most of them use techniques. This paper provides comprehensive review recent studies dealing with concepts, methodologies, optimization, benchmarks, open issues problems. starts by presenting essence as NP-COP, defining clarifying two formed classes timetabling: Course Timetabling Examination Timetabling, illustrating adopted for solving such problem, elaborating constraints achieving timetable, explaining how analyze measure performance demonstrating commonly benchmark datasets evaluation. It is noted meta-heuristic methodologies widely in literature. Additionally, recently, multi-objective has increasingly problem identify robust solutions. Finally, trends future directions provided. good information students, researchers, specialists interested this area research. challenges possibilities research prospects also explored.